Path planning in image space for autonomous robot navigation in unstructured environments

نویسندگان

  • Michael W. Otte
  • Scott G. Richardson
  • Jane Mulligan
  • Gregory Z. Grudic
چکیده

Path planning systems using graph-search algorithms such as A* usually operate in uniform plan-view occupancy grids. However, the sensors used to construct these grids observe the environment in their own sample space based on sensor type and viewpoint. In this paper we present an image space technique for path planning in unknown unstructured outdoor environments. Our method differs from previous techniques in that we perform path search directly in image space—the native sensor space of the imaging sensor. After an image space path has been found, it is used for navigation in the real world. By operating at the resolution of the image sensor, image space planning facilitates accurate robot vs. obstacle localization, and enables a high degree of movement precision. Our image space planning techniques can potentially be used with many different kinds of sensor data, and we experimentally evaluate the use of stereo disparity and color information. We present an extension to the basic image space planning system called the cylindrical planner that simulates a 2π field-of-view with a cylindrically shaped occupancy grid. We believe image space planning is well suited for use in the local subsystem of a hierarchical planner, and implement a hybrid hierarchical planner that utilizes the cylindrical planner as a local planning subsystem and a 2-dimensional Cartesian planner as the global planning subsystem. All three systems are implemented and experimentally tested on a real robot. We evaluate the failure modes of image space planning, and discuss how to avoid them. We find that image space enables precise real-time near-field planning.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Techniques for Path Planning in Image Space

We propose two new methods for performing local path search directly in the image space of a camera sensor. The first technique utilizes a high-resolution local image space subsystem to determine the farthest point along a global Cartesian path that can be reached along an unobstructed heading, thereby short-cutting as much of the global path as possible. To the best of our knowledge, this is t...

متن کامل

Local Path Planning in Image Space for Autonomous Robot Navigation in Unstructured Environments ; CU-CS-1030-07

An approach to stereo based local path planning in unstructured environments is presented. The approach differs from previous stereo based and image based planning systems (i.e. top-down occupancy grid planners, autonomous highway driving algorithms, and view-sequenced route representation), in that it uses specialized cost functions to find paths through an occupancy grid representation of wor...

متن کامل

New Techniques for Path Planning in Image Space ; CU-CS-1052-09

We propose two new methods for performing local path search directly in the image space of a camera sensor. The first technique utilizes a high-resolution local image space subsystem to determine the farthest point along a global Cartesian path that can be reached along an unobstructed heading, thereby short-cutting as much of the global path as possible. To the best of our knowledge, this is t...

متن کامل

Application of Hybrid A* to an Autonomous Mobile Robot for Path Planning in Unstructured Outdoor Environments

Efficient path planning is one of the main prerequisites for robust navigation of autonomous robots. Especially driving in complex environments containing both streets and unstructured regions is a challenging problem. In this paper we present the application of the Hybrid A* algorithm to a nonholonomic mobile outdoor robot in order to plan near optimal paths in mostly unknown and potentially i...

متن کامل

Mobile-robot navigation with complete coverage of unstructured environments

There are some mobile-robot applications that require the complete coverage of an unstructured environment. Examples are humanitarian de-mining and floor-cleaning tasks. A complete-coverage algorithm is then used, a path-planning technique that allows the robot to pass over all points in the environment, avoiding unknown obstacles. Different coverage algorithms exist, but they fail working in u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Field Robotics

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2009